Limitations of Skeptical Default Reasoning
نویسنده
چکیده
Poole has shown that nonmonotonic logics do not handle the lottery paradox correctly. In this paper we will show that Pollock's the ory of defeasible reasoning fails for the same reason: defeasible reasoning is incompatible with the skeptical notion of derivability.
منابع مشابه
Nonmonotonic Skeptical Consequence Relation in Constrained Default Logic
This paper presents a study of the nonmonotonic consequence relation which models the skeptical reasoning formalised by constrained default logic. The nonmonotonic skeptical consequence relation is defined using the sequent calculus axiomatic system. We study the formal properties desirable for a “good” nonmonotonic relation: supraclassicality, cut, cautious monotony, cumulativity, absorption, ...
متن کاملSkeptical Rational Extensions
In this paper we propose a version of default logic with the following two properties: (1) defaults with mutually inconsistent justi-cations are never used together in constructing a set of default consequences of a theory; (2) the reasoning formalized by our logic is related to the traditional skeptical mode of default reasoning. Our logic is based on the concept of a skeptical rational extens...
متن کاملTwo Cumulativity Results on J-and Pj-default Logics
This paper reports two cumulativity results for J-and PJ-default logics formalized by Del-grande and Jackson Delgrande and Jackson, 1991] in the context of skeptical reasoning: (1) PJ-default logic is cumulative, and (2) J-default logic is not cumulative in general but there is a nontrivial class of theories for which the cumu-lativity property can still hold. We also investigate semantical imp...
متن کاملProof Complexity of Propositional Default Logic
Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and skeptical reasoning in propositional default logic. In this paper we examine these calculi from a proof-complexity perspective. In particular, we show that the calculus for credulous reasoning obeys almost the same bou...
متن کاملSkeptical Query-Answering in Constrained Default Logic
An approach to skeptical query-answering in Constrained Default Logic based on the Connection Method is presented. We adapt a recently proposed general method to skeptical reasoning in Default Logics—a method which does neither strictly require the inspection of all extensions nor the computation of entire extensions to decide whether a formula is skeptically entailed. We combine this method wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997